MULTIVARIATE STATISTICAL INFERENCE UNDER MARGINAL STRUCTURE, II
نویسندگان
چکیده
منابع مشابه
Statistical Inference for the Lomax Distribution under Progressively Type-II Censoring with Binomial Removal
This paper considers parameter estimations in Lomax distribution under progressive type-II censoring with random removals, assuming that the number of units removed at each failure time has a binomial distribution. The maximum likelihood estimators (MLEs) are derived using the expectation-maximization (EM) algorithm. The Bayes estimates of the parameters are obtained using both the squared erro...
متن کاملOn Statistical Inference under Asymmetric
We introduce a wide class of asymmetric loss functions and show how to obtain asymmetric-type optimal decision rules from standard and commonly used Bayesian procedures. Important properties of minimum risk estimators are established. In particular, we discuss their sensitivity to the magnitude of asymmetry of the loss function.
متن کاملProcrustean statistical inference of deformations
A two step method has been devised for the statistical inference of deformation changes. In the first step of this method and based on Procrustes analysis of deformation tensors, the significance of the change in a time or space series of deformation tensors is statistically analyzed. In the second step significant change(s) in deformations are localized. In other words, they are assigned to ce...
متن کاملGeneral Theory of Inferential Models Ii . Marginal Inference
This paper is a continuation of the authors’ theoretical investigation of inferential model (IMs); see Martin, Hwang and Liu (2010). The fundamental idea is that prior-free posterior probability-like inference with desirable long-run frequency properties can be achieved through a system based on predicting unobserved auxiliary variables. In Part I, an intermediate conditioning step was proposed...
متن کاملAnytime Marginal MAP Inference
This paper presents a new anytime algorithm for the marginal MAP problem in graphical models of bounded treewidth. We show asymptotic convergence and theoretical error bounds for any fixed step. Experiments show that it compares well to a state-of-the-art systematic search algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETS Research Bulletin Series
سال: 1973
ISSN: 0424-6144
DOI: 10.1002/j.2333-8504.1973.tb00849.x